Asymptotic degree distribution in random recursive trees
نویسنده
چکیده
The distributions of vertex degrees in random recursive trees and random plane recursive trees are shown to be asymptotically normal. Formulas are given for the asymptotic variances and covariances of the number of vertices with given outdegrees. We also give functional limit theorems for the evolution as vertices are added. The proofs use some old and new results about generalized Pólya urn models. We consider generalized Pólya urns with infinitely many types, but reduce them to the finite type case.
منابع مشابه
The eccentric connectivity index of bucket recursive trees
If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.
متن کاملLimit distribution of the degrees in scaled attachment random recursive trees
We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...
متن کاملDegrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملOn the first variable Zagreb index
The first variable Zagreb index of graph $G$ is defined as begin{eqnarray*} M_{1,lambda}(G)=sum_{vin V(G)}d(v)^{2lambda}, end{eqnarray*} where $lambda$ is a real number and $d(v)$ is the degree of vertex $v$. In this paper, some upper and lower bounds for the distribution function and expected value of this index in random increasing trees (rec...
متن کاملLimit distribution for the maximum degree of a random recursive tree
If a recursive tree is selected uniformly at random from among all recursive trees on n vertices, then the distribution of the maximum in-degree is given asymptotically by the following theorem: for any 3xed integer d, Pn( 6 n + d)= exp(−2{ n}−d−1) + o(1) as n → ∞; where n = log2 n. (As usual, n denotes the greatest integer less than or equal to n, and { n}= n− n :) The proof makes extensive us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 26 شماره
صفحات -
تاریخ انتشار 2005